The forbidden subgraph problem is a prime example of the rather large family of extremal problems is graph theory. 禁向子图问题是图论中相当大的一类极值问题中的主要例子。
The upper boundary and the extremal graph properties of the strong chromatic number χ s ( G) of a simple graph G ( V, E) are studied. 研究了简单图G(V,E)的强色数χs(G)的上界与极图及χs(G)与全色数χT(G)的关系;
Extremal Graph Theory and Degree Sequences 极值图论与度序列
The Extremal Graph of κ th Upper Generalized Exponents for a Class of Primitive Graphs 一类本原无向图的广义上指数的极图
The Extremal Property of the Maximally Saturated Graph D ( n, k) and its Circuit Uniqueness is maximum. Circle of Friends 极大饱和图D(n,k)的极值性质及圈唯一性
Extremal Graph Theory and Degree Sequences We prove it by the method of successive approximation and maximum priciple. 极值图论与度序列采用的方法是序列逼近法和极值原理。
On the basis, we proved that the extremal graph with maximum degree distance of unicyclic graphs is obtained from a triangle C_3 by attaching a pendent path P_ ( n-3). 本文对上述问题进一步讨论,确定了具有最大度距离的单圈图是由一个三角形并在其一个顶点粘上一条悬挂路P(n-3)构成的。